Scheduling periodic tasks on uniform multiprocessors

نویسنده

  • Sanjoy K. Baruah
چکیده

A uniform multiprocessor machine is comprised of an integer number of processors. Each processor P is characterized by a computing capacity P:c with the interpretation that a job executing on processor P for t time units completes (Pj:c t) units of execution. The scheduling of systems of periodic tasks on uniform multiprocessor systems is considered.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricting EDF migration on uniform multiprocessors

Restricted migration of periodic and sporadic tasks on uniform multiprocessors is considered. On multiprocessors, job migration can cause a prohibitively high overhead — particularly in real-time systems where accurate timing is essential. However, if periodic tasks do not maintain state between separate invocations, different jobs of the same task may be allowed to execute on different process...

متن کامل

Rate-Monotonic Scheduling on Uniform Multiprocessors

The rate-monotonic algorithm is arguably one of the most popular algorithms for scheduling systems of periodic real-time tasks. The rate-monotonic scheduling of systems of periodic tasks on uniform multiprocessor platforms is considered here. A simple, sufficient test is presented for determining whether a given periodic task system will be successfully scheduled by this algorithm upon a partic...

متن کامل

Task assignment in heterogeneous multiprocessor platforms ∗

In the partitioned approach to scheduling periodic tasks upon multiprocessors, each task is assigned to a specific processor and all jobs generated by a task are required to execute upon the processor to which the task is assigned. In this paper, the partitioning of periodic task systems upon uniform multiprocessors – multiprocessor platforms in which different processors have different computi...

متن کامل

Towards Compositional Hierarchical Scheduling Frameworks on Uniform Multiprocessors

In this report, we approach the problem of defining and analysing compositional hierarchical scheduling frameworks (HSF) upon uniform multiprocessor platforms. For this we propose the uniform multiprocessor periodic resource (UMPR) model for a component interface. We extend previous results (for dedicated uniform multiprocessors, and for compositional HSFs on identical multiprocessors), providi...

متن کامل

On-Line Scheduling on Uniform Multiprocessors

Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed for time units completes units of execution. The on-line scheduling of hard-real-time systems, in which all jobs must complete by specified deadlines, on uniform multiprocessor machines is considered. It is known that online...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 80  شماره 

صفحات  -

تاریخ انتشار 2000